Combinatorial Properties of Classical Forcing Notions

[6] J. Brendle, Combinatorial Properties of Classic Forcing Notions, Annals

Forcing indestructibility of MAD families

Let A ⊆ [ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families wh...

Mathias-Prikry and Laver-Prikry type forcing

We study the Mathias-Prikry and Laver-Prikry forcings associated with filters on ω. We give a combinatorial characterization of Martin’s number for these forcing notions and present a general scheme for analyzing preservation properties for them. In particular, we give a combinatorial characterization of those filters for which the Mathias-Prikry forcing does not add any dominating reals.

$L$-Topological Spaces

‎By substituting the usual notion of open sets in a topological space $X$ with a suitable collection of maps from $X$ to a frame $L$, we introduce the notion of L-topological spaces. Then, we proceed to study the classical notions and properties of usual topological spaces to the newly defined mathematical notion. Our emphasis would be concentrated on the well understood classical connectedness...

Uniform unfolding and analytic measurability

There are many natural forcing notions adding real numbers, most notably the precursors of this class of forcing notions, namely Cohen and Random forcing. Whereas Random forcing has been deliberately constructed in connection with the σ–algebra of Lebesgue measurable sets and Cohen forcing is represented by the algebra of Borel sets modulo the σ–ideal of meager sets, the other classical forcing...